منابع مشابه
Majorities and individuals.
Lucky you, if you happen to live in one of the democratic western countries, because then you live in a society that gives you maximal freedom and opportunities to pursue your goals. But what if you are one of the disgruntled people who think that our elected leaders have got a certain issue all wrong and nobody except you is smart enough to see that they are heading the wrong way? Then you hav...
متن کاملSpecial Majorities Rationalized
Complaints are common about the arbitrary and conservative bias of special-majority rules. Such complaints, however, apply to asymmetrical versions of those rules alone. Symmetrical special-majority rules remedy that defect, albeit at the cost of often rendering no determinate verdict. Here what is formally at stake, both procedurally and epistemically, is explored in the choice between those t...
متن کاملFormula Complexity of Ternary Majorities
It is known that any self-dual Boolean function can be decomposed into compositions of 3-bit majority functions. In this paper, we define a notion of a ternary majority formula, which is a ternary tree composed of nodes labeled by 3-bit majority functions and leaves labeled by literals. We study their complexity in terms of formula size. In particular, we prove upper and lower bounds for ternar...
متن کاملRange Majorities and Minorities in Arrays
Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks us to preprocess a string of length n such that, given the endpoints of a range, one can quickly find all the distinct elements whose relative frequencies in that range are more than a threshold τ . Subsequent authors have reduced their time and space bounds such that, when τ is fixed at preprocessin...
متن کاملPseudorandomness for concentration bounds and signed majorities
The problem of constructing pseudorandom generators that fool halfspaces has been studied intensively in recent times. For fooling halfspaces over {±1}n with polynomially small error, the best construction known requires seed-length O(log(n)) [MZ13]. Getting the seed-length down to O(log(n)) is a natural challenge in its own right, which needs to be overcome in order to derandomize RL. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EMBO reports
سال: 2002
ISSN: 1469-221X,1469-3178
DOI: 10.1093/embo-reports/kvf101